A Gitik iteration with nearly Easton factoring
نویسنده
چکیده
We reprove Gitik’s theorem that if the GCH holds and o(κ) = κ + 1 then there is a generic extension in which κ is still measurable and there is a closed unbounded subset C of κ such that every ν ∈ C is inaccessible in the ground model. Unlike the forcing used by Gitik, the iterated forcing Rλ+1 used in this paper has the property that if λ is a cardinal less then κ then Rλ+1 can be factored in V as Rκ+1 = Rλ+1 ×Rλ+1,κ where |Rλ+1| ≤ λ and Rλ+1,κ does not add any new subsets of λ. §
منابع مشابه
Power function on stationary classes
We show that under certain large cardinal requirements there is a generic extension in which the power function behaves differently on different stationary classes. We achieve this by doing an Easton support iteration of the Radin on extenders forcing.
متن کاملOn The Convergence Of Modified Noor Iteration For Nearly Lipschitzian Maps In Real Banach Spaces
In this paper, we obtained the convergence of modified Noor iterative scheme for nearly Lipschitzian maps in real Banach spaces. Our results contribute to the literature in this area of re- search.
متن کاملViolating the Singular Cardinals Hypothesis Without Large Cardinals
Easton proved that the behavior of the exponential function 2 at regular cardinals κ is independent of the axioms of set theory except for some simple classical laws. The Singular Cardinals Hypothesis SCH implies that the Generalized Continuum Hypothesis GCH 2 = κ holds at a singular cardinal κ if GCH holds below κ. Gitik and Mitchell have determined the consistency strength of the negation of ...
متن کاملAn Iteration Model violating the Singular Cardinals Hypothesis
Models of Set Theory showing exotic behaviour at singular cardinals are usually constructed via forcing. The archetypical method is Prikry-Forcing [Pr1970], which has been generalized in various ways, as for example by Gitik and Magidor [GiMa1992]. It was observed early that Prikry generic sequences can be obtained as successive critical points in an iteration of the universe V by a normal ultr...
متن کاملSome iterations for factoring a polynomial
This paper describes an iterative method for factoring a polynomial that bears the same relation to Bairstow's method as the secant method in a single variable bears to Newton's method. Like the secant method, the generalized secant method requires only one function evaluation for each iteration, and like the secant method it converges to a simple factor with order (1+75)/2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 68 شماره
صفحات -
تاریخ انتشار 2003